Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
نویسندگان
چکیده
منابع مشابه
Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution
In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. ...
متن کاملKey Preassigned Traceability Schemes for Broadcast Encryption
Traceability schemes for broadcast encryption are deened by Chor, Fiat and Naor in 6] to protect against a possible coalition of users producing an illegal decryption key. Their scheme was then generalized by Stinson and Wei in 17]. These schemes assume that every user can decrypt the secret value. In this paper we discuss key preassigned tra-cability schemes, in which only the users in a speci...
متن کاملOn Broadcast Encryption with Random Key Pre-distribution Schemes
Broadcast encryption (BE) deals with the problem of establishing a secret, shared by g = G − r privileged nodes, among a set G nodes. Specifically, a set of r revoked nodes are denied access to the secret. Many schemes to address this problem, based on key pre-distribution schemes (KPS), have been proposed in the literature. Most state-ofthe-art methods employ tree-based techniques. However, ra...
متن کاملGeneralized Identity Based and Broadcast Encryption Schemes
We provide a general framework for constructing identitybased and broadcast encryption systems. In particular, we construct a general encryption system called spatial encryption from which many systems with a variety of properties follow. The ciphertext size in all these systems is independent of the number of users involved and is just three group elements. Private key size grows with the comp...
متن کاملOn Generalized Greedy Algorithms in Broadcast Key Distribution Schemes
In [1] a key distribution scheme for broadcast encryption based on 2-designs was proposed. The connectivity of this scheme is the maximal number of messages which should be broadcasted by the center to the non-compromised users to generate a common key. This value was upper bounded in [1] with the use of the greedy algorithm. Unfortunately it is a very crude bound. We propose the generalized gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)80007-8